0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.34	% Computer   : n028.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 15:26:01 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.34	% Number of cores: 8
0.13/0.35	% Python version: Python 3.6.8
0.13/0.35	# Version: 2.6rc1-ho
0.13/0.35	# No SInE strategy applied
0.13/0.35	# Trying AutoSched0 for 59 seconds
0.20/0.39	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.20/0.39	# and selection function SelectComplexExceptUniqMaxHorn.
0.20/0.39	#
0.20/0.39	# Preprocessing time       : 0.033 s
0.20/0.39	# Presaturation interreduction done
0.20/0.39	
0.20/0.39	# Proof found!
0.20/0.39	# SZS status Theorem
0.20/0.39	# SZS output start CNFRefutation
0.20/0.39	thf(mbox, axiom, (mbox)=(^[X25:$i > $o, X26:$i]:![X27:$i]:(~(rel @ X26 @ X27)|X25 @ X27)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mbox)).
0.20/0.39	thf(mbox_generic, axiom, (mbox_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:![X16:$i]:(~(X15 @ X3 @ X16)|X4 @ X16)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mbox_generic)).
0.20/0.39	thf(defD1, axiom, (god)=(^[X1:mu, X32:$i]:![X33:mu > $i > $o]:(positive @ X33 @ X32=>X33 @ X1 @ X32)), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', defD1)).
0.20/0.39	thf(mimplies, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3=>X5 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mimplies)).
0.20/0.39	thf(mforall_indset, axiom, (mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:![X8:mu > $i > $o]:X7 @ X8 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mforall_indset)).
0.20/0.39	thf(defD2, axiom, (essence)=(^[X18:mu > $i > $o, X1:mu, X60:$i]:(X18 @ X1 @ X60&![X65:mu > $i > $o]:(X65 @ X1 @ X60=>![X66:$i]:(~(rel @ X60 @ X66)|![X67:mu]:(X18 @ X67 @ X66=>X65 @ X67 @ X66))))), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', defD2)).
0.20/0.39	thf(mand, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3&X5 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mand)).
0.20/0.39	thf(mforall_ind, axiom, (mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:![X1:mu]:X6 @ X1 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mforall_ind)).
0.20/0.39	thf(thmT2, conjecture, mvalid @ (mforall_ind @ (^[X1:mu]:mimplies @ (god @ X1) @ (essence @ god @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thmT2)).
0.20/0.39	thf(mvalid, axiom, (mvalid)=(^[X4:$i > $o]:![X3:$i]:X4 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mvalid)).
0.20/0.39	thf(axA1, axiom, mvalid @ (mforall_indset @ (^[X21:mu > $i > $o]:mequiv @ (positive @ (^[X1:mu]:mnot @ (X21 @ X1))) @ (mnot @ (positive @ X21)))), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', axA1)).
0.20/0.39	thf(mnot, axiom, (mnot)=(^[X4:$i > $o, X3:$i]:~(X4 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mnot)).
0.20/0.39	thf(mequiv, axiom, (mequiv)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3<=>X5 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mequiv)).
0.20/0.39	thf(axA4, axiom, mvalid @ (mforall_indset @ (^[X24:mu > $i > $o]:mimplies @ (positive @ X24) @ (mbox @ (positive @ X24)))), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', axA4)).
0.20/0.39	thf(c_0_14, axiom, (mbox)=(^[X25:$i > $o, X26:$i]:![X27:$i]:(~(rel @ X26 @ X27)|X25 @ X27)), inference(apply_def,[status(thm)],[mbox, mbox_generic])).
0.20/0.39	thf(c_0_15, axiom, (god)=(^[X1:mu, X32:$i]:![X33:mu > $i > $o]:(positive @ X33 @ X32=>X33 @ X1 @ X32)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[defD1, mimplies]), mforall_indset])).
0.20/0.39	thf(c_0_16, axiom, (essence)=(^[X18:mu > $i > $o, X1:mu, X60:$i]:(X18 @ X1 @ X60&![X65:mu > $i > $o]:(X65 @ X1 @ X60=>![X66:$i]:(~(rel @ X60 @ X66)|![X67:mu]:(X18 @ X67 @ X66=>X65 @ X67 @ X66))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[defD2, mand]), mimplies]), mforall_ind]), mforall_indset]), c_0_14])).
0.20/0.39	thf(c_0_17, plain, ![X128:$i, X127:mu, X126:mu > $i > $o]:(epred1_3 @ X126 @ X127 @ X128<=>~X126 @ X127 @ X128), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.20/0.39	thf(c_0_18, negated_conjecture, ~(![X251:$i, X260:mu]:(![X261:mu > $i > $o]:(positive @ X261 @ X251=>X261 @ X260 @ X251)=>(![X262:mu > $i > $o]:(positive @ X262 @ X251=>X262 @ X260 @ X251)&![X263:mu > $i > $o]:(X263 @ X260 @ X251=>![X264:$i]:(~rel @ X251 @ X264|![X265:mu]:(![X266:mu > $i > $o]:(positive @ X266 @ X264=>X266 @ X265 @ X264)=>X263 @ X265 @ X264)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thmT2]), mimplies]), mforall_ind]), mvalid]), c_0_15]), c_0_16])])).
0.20/0.39	thf(c_0_19, plain, ![X121:$i, X126:mu > $i > $o]:(positive @ (epred1_3 @ X126) @ X121<=>~positive @ X126 @ X121), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA1, mnot]), mequiv]), mforall_indset]), mvalid]), c_0_17])])).
0.20/0.39	thf(c_0_20, negated_conjecture, ![X281:mu > $i > $o, X286:mu > $i > $o]:((~positive @ X281 @ esk3_0|X281 @ esk4_0 @ esk3_0)&(((epred5_0 @ esk4_0 @ esk3_0|positive @ epred4_0 @ esk3_0)&((rel @ esk3_0 @ esk5_0|positive @ epred4_0 @ esk3_0)&((~positive @ X286 @ esk5_0|X286 @ esk6_0 @ esk5_0|positive @ epred4_0 @ esk3_0)&(~epred5_0 @ esk6_0 @ esk5_0|positive @ epred4_0 @ esk3_0))))&((epred5_0 @ esk4_0 @ esk3_0|~epred4_0 @ esk4_0 @ esk3_0)&((rel @ esk3_0 @ esk5_0|~epred4_0 @ esk4_0 @ esk3_0)&((~positive @ X286 @ esk5_0|X286 @ esk6_0 @ esk5_0|~epred4_0 @ esk4_0 @ esk3_0)&(~epred5_0 @ esk6_0 @ esk5_0|~epred4_0 @ esk4_0 @ esk3_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])).
0.20/0.39	thf(c_0_21, plain, ![X267:$i, X268:mu > $i > $o]:((~positive @ (epred1_3 @ X268) @ X267|~positive @ X268 @ X267)&(positive @ X268 @ X267|positive @ (epred1_3 @ X268) @ X267)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])).
0.20/0.39	thf(c_0_22, plain, ![X287:$i, X288:mu, X289:mu > $i > $o]:((~epred1_3 @ X289 @ X288 @ X287|~X289 @ X288 @ X287)&(X289 @ X288 @ X287|epred1_3 @ X289 @ X288 @ X287)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])).
0.20/0.39	thf(c_0_23, negated_conjecture, ![X6:mu > $i > $o]:(X6 @ esk4_0 @ esk3_0|~positive @ X6 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_24, plain, ![X6:mu > $i > $o, X3:$i]:(positive @ X6 @ X3|positive @ (epred1_3 @ X6) @ X3), inference(split_conjunct,[status(thm)],[c_0_21])).
0.20/0.39	thf(c_0_25, plain, ![X203:$i, X207:mu > $i > $o]:(positive @ X207 @ X203=>![X208:$i]:(~rel @ X203 @ X208|positive @ X207 @ X208)), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA4, mimplies]), mforall_indset]), c_0_14]), mvalid])])).
0.20/0.39	thf(c_0_26, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:(~epred1_3 @ X6 @ X1 @ X3|~X6 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_22])).
0.20/0.39	thf(c_0_27, negated_conjecture, ![X6:mu > $i > $o]:(epred1_3 @ X6 @ esk4_0 @ esk3_0|positive @ X6 @ esk3_0), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.20/0.39	thf(c_0_28, plain, ![X276:$i, X277:mu > $i > $o, X278:$i]:(~positive @ X277 @ X276|(~rel @ X276 @ X278|positive @ X277 @ X278)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])).
0.20/0.39	thf(c_0_29, plain, ![X6:mu > $i > $o]:(positive @ X6 @ esk3_0|~X6 @ esk4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_26, c_0_27])).
0.20/0.39	thf(c_0_30, negated_conjecture, (epred5_0 @ esk4_0 @ esk3_0|positive @ epred4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_31, plain, ![X3:$i, X6:mu > $i > $o, X16:$i]:(positive @ X6 @ X16|~positive @ X6 @ X3|~rel @ X3 @ X16), inference(split_conjunct,[status(thm)],[c_0_28])).
0.20/0.39	thf(c_0_32, negated_conjecture, (positive @ epred4_0 @ esk3_0|positive @ epred5_0 @ esk3_0), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.20/0.39	thf(c_0_33, negated_conjecture, ![X3:$i]:(positive @ epred4_0 @ esk3_0|positive @ epred5_0 @ X3|~rel @ esk3_0 @ X3), inference(spm,[status(thm)],[c_0_31, c_0_32])).
0.20/0.39	thf(c_0_34, negated_conjecture, (rel @ esk3_0 @ esk5_0|positive @ epred4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_35, negated_conjecture, ![X6:mu > $i > $o]:(X6 @ esk6_0 @ esk5_0|positive @ epred4_0 @ esk3_0|~positive @ X6 @ esk5_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_36, negated_conjecture, (positive @ epred5_0 @ esk5_0|positive @ epred4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_33, c_0_34])).
0.20/0.39	thf(c_0_37, negated_conjecture, (positive @ epred4_0 @ esk3_0|~epred5_0 @ esk6_0 @ esk5_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_38, negated_conjecture, (epred5_0 @ esk4_0 @ esk3_0|~epred4_0 @ esk4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_39, negated_conjecture, positive @ epred4_0 @ esk3_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])).
0.20/0.39	thf(c_0_40, negated_conjecture, (positive @ epred5_0 @ esk3_0|~epred4_0 @ esk4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_29, c_0_38])).
0.20/0.39	thf(c_0_41, negated_conjecture, epred4_0 @ esk4_0 @ esk3_0, inference(spm,[status(thm)],[c_0_23, c_0_39])).
0.20/0.39	thf(c_0_42, negated_conjecture, positive @ epred5_0 @ esk3_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])])).
0.20/0.39	thf(c_0_43, negated_conjecture, (rel @ esk3_0 @ esk5_0|~epred4_0 @ esk4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_44, negated_conjecture, ![X6:mu > $i > $o]:(X6 @ esk6_0 @ esk5_0|~positive @ X6 @ esk5_0|~epred4_0 @ esk4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_45, negated_conjecture, ![X3:$i]:(positive @ epred5_0 @ X3|~rel @ esk3_0 @ X3), inference(spm,[status(thm)],[c_0_31, c_0_42])).
0.20/0.39	thf(c_0_46, negated_conjecture, rel @ esk3_0 @ esk5_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_41])])).
0.20/0.39	thf(c_0_47, negated_conjecture, (~epred5_0 @ esk6_0 @ esk5_0|~epred4_0 @ esk4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.39	thf(c_0_48, negated_conjecture, ![X6:mu > $i > $o]:(X6 @ esk6_0 @ esk5_0|~positive @ X6 @ esk5_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_41])])).
0.20/0.39	thf(c_0_49, negated_conjecture, positive @ epred5_0 @ esk5_0, inference(spm,[status(thm)],[c_0_45, c_0_46])).
0.20/0.39	thf(c_0_50, negated_conjecture, ~epred5_0 @ esk6_0 @ esk5_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47, c_0_41])])).
0.20/0.39	thf(c_0_51, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_50]), ['proof']).
0.20/0.39	# SZS output end CNFRefutation
0.20/0.39	# Proof object total steps             : 52
0.20/0.39	# Proof object clause steps            : 27
0.20/0.39	# Proof object formula steps           : 25
0.20/0.39	# Proof object conjectures             : 26
0.20/0.39	# Proof object clause conjectures      : 23
0.20/0.39	# Proof object formula conjectures     : 3
0.20/0.39	# Proof object initial clauses used    : 12
0.20/0.39	# Proof object initial formulas used   : 14
0.20/0.39	# Proof object generating inferences   : 11
0.20/0.39	# Proof object simplifying inferences  : 10
0.20/0.39	# Training examples: 0 positive, 0 negative
0.20/0.39	# Parsed axioms                        : 59
0.20/0.39	# Removed by relevancy pruning/SinE    : 0
0.20/0.39	# Initial clauses                      : 58
0.20/0.39	# Removed in clause preprocessing      : 28
0.20/0.39	# Initial clauses in saturation        : 30
0.20/0.39	# Processed clauses                    : 122
0.20/0.39	# ...of these trivial                  : 1
0.20/0.39	# ...subsumed                          : 5
0.20/0.39	# ...remaining for further processing  : 116
0.20/0.39	# Other redundant clauses eliminated   : 10
0.20/0.39	# Clauses deleted for lack of memory   : 0
0.20/0.39	# Backward-subsumed                    : 1
0.20/0.39	# Backward-rewritten                   : 22
0.20/0.39	# Generated clauses                    : 224
0.20/0.39	# ...of the previous two non-trivial   : 164
0.20/0.39	# Contextual simplify-reflections      : 1
0.20/0.39	# Paramodulations                      : 91
0.20/0.39	# Factorizations                       : 0
0.20/0.39	# NegExts                              : 54
0.20/0.39	# Equation resolutions                 : 10
0.20/0.39	# Propositional unsat checks           : 0
0.20/0.39	#    Propositional check models        : 0
0.20/0.39	#    Propositional check unsatisfiable : 0
0.20/0.39	#    Propositional clauses             : 0
0.20/0.39	#    Propositional clauses after purity: 0
0.20/0.39	#    Propositional unsat core size     : 0
0.20/0.39	#    Propositional preprocessing time  : 0.000
0.20/0.39	#    Propositional encoding time       : 0.000
0.20/0.39	#    Propositional solver time         : 0.000
0.20/0.39	#    Success case prop preproc time    : 0.000
0.20/0.39	#    Success case prop encoding time   : 0.000
0.20/0.39	#    Success case prop solver time     : 0.000
0.20/0.39	# Current number of processed clauses  : 55
0.20/0.39	#    Positive orientable unit clauses  : 14
0.20/0.39	#    Positive unorientable unit clauses: 0
0.20/0.39	#    Negative unit clauses             : 21
0.20/0.39	#    Non-unit-clauses                  : 20
0.20/0.39	# Current number of unprocessed clauses: 92
0.20/0.39	# ...number of literals in the above   : 202
0.20/0.39	# Current number of archived formulas  : 0
0.20/0.39	# Current number of archived clauses   : 61
0.20/0.39	# Clause-clause subsumption calls (NU) : 486
0.20/0.39	# Rec. Clause-clause subsumption calls : 306
0.20/0.39	# Non-unit clause-clause subsumptions  : 4
0.20/0.39	# Unit Clause-clause subsumption calls : 177
0.20/0.39	# Rewrite failures with RHS unbound    : 0
0.20/0.39	# BW rewrite match attempts            : 6
0.20/0.39	# BW rewrite match successes           : 6
0.20/0.39	# Condensation attempts                : 0
0.20/0.39	# Condensation successes               : 0
0.20/0.39	# Termbank termtop insertions          : 6157
0.20/0.39	
0.20/0.39	# -------------------------------------------------
0.20/0.39	# User time                : 0.038 s
0.20/0.39	# System time              : 0.006 s
0.20/0.39	# Total time               : 0.044 s
0.20/0.39	# Maximum resident set size: 1724 pages
0.20/0.39	EOF